#include <bits/stdc++.h>
using namespace std;

const int N=1e5+5;
long long n,a[N],cnt,now;
bool vis[N];

int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin >> n;
    for (int i=1;i<=n;i++){
        scanf("%lld", &a[i]);
    }
    sort(a+1,a+1+n);
    now=1;
    for (int i=2;i<=n;i++){
        if (a[i]>a[now]){
            vis[now]=1;
            now++;
        }
    }
    for (int i=1;i<=n;i++){
        if (!vis[i]) cnt++;
    }
    cout << cnt;
    return 0;
}
